GATE CSE 2015 SET-3
Q21.
Consider a binary tree T that has 200 leaf nodes. Then, the number of nodes in T that have exactly two children are ________.Q22.
Which of the following languages are context-free? L_{1}=\{a^{m}b^{n}a^{n}b^{m}|m,n\geq 1\} L_{2}=\{a^{m}b^{n}a^{m}b^{n}|m,n\geq 1\} L_{3}=\{a^{m}b^{n}|m=2n+1\}Q23.
For the processes listed in the following table, which of the following scheduling schemes will give the lowest average turnaround time?Q24.
Consider the following C program: #include < stdio.h > int main( ) { int i, j, k = 0; j = 2 * 3 / 4 + 2.0 / 5 + 8 / 5; k -= --j; for(i = 0; i < 5; i++) { switch(i + k) { case 1: case 2: printf("n%d", i+k); case 3: printf("n%d", i+k); default: printf("n%d", i+k); } } return 0; } The number of times printf statement is executed is ________.Q25.
Consider a CSMA/CD network that transmits data at a rate of 100 Mbps (10^{8} bits per second) over a 1 km (kilometer) cable with no repeaters. If the minimum frame size required for this network is 1250 bytes, what is the signal speed (km/sec) in the cable?Q26.
Consider the following policies for preventing deadlock in a system with mutually exclusive resources. I. Processes should acquire all their resources at the beginning of execution. If any resource is not available, all resources acquired so far are released II. The resources are numbered uniquely, and processes are allowed to request for resources only in increasing resource numbers III. The resources are numbered uniquely, and processes are allowed to request for resources only in decreasing resource numbers IV. The resources are numbered uniquely. A process is allowed to request only for a resource with resource number larger than its currently held resources Which of the above policies can be used for preventing deadlock?Q27.
Given the function F=P'+QR , where F is a function in three Boolean variables P,Q and R and P'=!P, consider the following statements. (S1) F=\Sigma(4,5,6) (S2) F=\Sigma(0,1,2,3,7) (S3) F=\Pi(4,5,6) (S4) F=\Pi(0,1,2,3,7) Which of the following is true?Q28.
Let # be a binary operator defined as X#Y=X'+Y' where X and Y are Boolean variables. Consider the following two statements. (S1) (P # Q) # R = P # (Q # R) (S2) Q # R = R # Q Which of the following is/are true for the Boolean variables P, Q and R?Q29.
The total number of prime implicants of the function f(w,x,y,z)=\Sigma(0,2,4,5,6,10) is _______.Q30.
Two hosts are connected via a packet switch with 10^{7} bits per second links. Each link has a propagation delay of 20 microseconds. The switch begins forwarding a packet 35 microseconds after it receives the same. If 10000 bits of data are to be transmitted between the two hosts using a packet size of 5000 bits, the time elapsed between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is____________.